GRASP with path relinking for the symmetric Euclidean clustered traveling salesman problem
نویسندگان
چکیده
منابع مشابه
Euclidean Traveling Salesman Problem
Since the computation of an exact solution is very expensive (under the assumption that P 6= NP ), we are interested in approximate solutions – at least for special cases. Particularly, we look for an Polynomial Time Approximation Scheme (PTAS), i.e., for any fixed error parameter ε > 0, the running time is bounded by a polynomial in n and the costs of the computed tour does not exceed (1+ε) ·O...
متن کاملGRASP with path relinking heuristics for the antibandwidth problem
This paper proposes a linear integer programming formulation and several heuristics based on GRASP and path relinking for the antibandwidth problem. In the antibandwidth problem, one is given an undirected graph with n nodes and must label the nodes in a way that each node receives a unique label from the set {1, 2, . . . , n}, such that, among all adjacent node pairs, the minimum difference be...
متن کاملRevised GRASP with path-relinking for the linear ordering problem
W. Art Chaovalitwongse Department of Industrial and Systems Engineering, Rutgers University 96 Frelinghuysen Rd., Piscataway, New Jersey 08854, USA [email protected] Carlos A.S. Oliveira Princeton Consultants Inc. 2 Research Way, Princeton, NJ 08540 [email protected] Bruno Chiarini PO Box 522274, Miami, FL 33152. [email protected] Panos M. Pardalos Department of Industrial and Syst...
متن کاملGRASP with path relinking for the orienteering problem
In this paper, we address an optimization problem resulting from the combination of the wellknown traveling salesman and knapsack problems. In particular, we target the orienteering problem, originated in the context of sports, which consists of maximizing the total score associated with the vertices visited in a path within the available time. The problem, also known as the selective travellin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Operations Research
سال: 2013
ISSN: 0305-0548
DOI: 10.1016/j.cor.2012.10.001